Interpolating between bounds on the independence number
نویسندگان
چکیده
منابع مشابه
Interpolating between bounds on the independence number
For a non-negative integer T , we prove that the independence number of a graph G = (V,E) in which every vertex belongs to at most T triangles is at least ∑ u∈V f(d(u), T ) where d(u) denotes the degree of a vertex u ∈ V , f(d, T ) = 1 d+1 for T ≥ ( d 2 ) and f(d, T ) = (1 + (d2− d− 2T )f(d− 1, T ))/(d2 + 1− 2T ) for T < ( d 2 ) . This is a common generalization of the lower bounds for the inde...
متن کاملThe Independence Number Project: Α-bounds
A lower bound for the independence number of a graph is a graph invariant l such that, for every graph G, l(G) ≤ α(G). Similarly, an upper bound for the independence number is a graph invariant u such that, for every graph G, α(G) ≤ u(G). Many efficiently computable upper and lower bounds, called α-bounds here, have been published and these are surveyed in the following section. They can be use...
متن کاملBounds on the signed 2-independence number in graphs
Let G be a finite and simple graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If ∑ x∈N [v] f(x) ≤ 1 for each v ∈ V (G), where N [v] is the closed neighborhood of v, then f is a signed 2independence function onG. The weight of a signed 2-independence function f is w(f) = ∑ v∈V (G) f(v). The maximum of weights w(f), taken over all signed 2-independence functions ...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملBounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.05.026